A population-based algorithm for the railroad blocking problem
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولA Comprehensive Formulation For Railroad Blocking Problem
In rail transportation, there have been several attempts to determine the best routes for shipments (a number of cars with the same origin-destination) through the network. Shipments enter into several intermediate yards on their routes to separate and regroup shipments into new trains. Most of time, every entering into a yard includes excessive delay for shipments; therefore it is an ideal pla...
متن کاملBranch-and-Price for a European variant of the Railroad Blocking Problem
In wagonload traffic, a production form in railway freight traffic, small groups of wagons have to be transported. In order to decrease transportation costs, wagons from different relations are consolidated. In railyards trains can be separated and rearranged to new trains. The costs arising from this process, which is called reclassification, must be balanced with the transportation costs. The...
متن کاملDesigning Robust Railroad Blocking Plans
On major domestic railroads, a typical general merchandise shipment, or commodity, may pass through many classification yards on its route from origin to destination. At these yards, the incoming traffic, which may consist of several shipments, is reclassified (sorted and grouped together) to be placed on outgoing trains. On average, each reclassification results in an one day delay for the shi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Industrial Engineering International
سال: 2012
ISSN: 1735-5702,2251-712X
DOI: 10.1186/2251-712x-8-8